A Novel Approach for Off-Line Multiprocessor Scheduling in Embedded Hard Real-Time Systems

There are two general approaches for scheduling tasks in real-time systems: runtime and pre-runtime scheduling. However, there are several situations where the runtime approach does not find a feasible schedule even if such a schedule exists. The proposed approach uses state space exploration for finding a preruntime scheduling. The main problem with such methods is the space size, which can grow exponentially. This paper shows how to minimize this problem, and presents a depth-first search method on a timed labeled transition system derived from the time Petri net model.